Geometric dynamics of optimization

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometric Dynamics of Optimization

This paper investigates a family of dynamical systems arising from an evolutionary re-interpretation of certain optimal control and optimization problems. We focus particularly on the application in image registration of the theory of metamorphosis. Metamorphosis is a means of tracking the optimal changes of shape that are necessary for registration of images with various types of data structur...

متن کامل

Computational fluid dynamics analysis and geometric optimization of solar chimney power plants by using of genetic algorithm

In this paper, a multi-objective optimization method is implemented by using of genetic algorithm techniques in order to determine optimum configuration of solar chimney power plant. The objective function which is simultaneously considered in the analysis is output power of the plant. Output power of the system is maximized. Design parameters of the considered plant include collector radius (R...

متن کامل

Geometric Optimization of Fenestration

Fenestration and its design have a significant impact on the energy use associated with the artificial lighting, heating and cooling of a building. To date, research into window optimization has been for windows that are constrained to have a regular geometric shape and position. This paper describes an approach in which a building façade is divided into a number of cells, each cell having one ...

متن کامل

Eecient Algorithms for Geometric Optimization Eecient Algorithms for Geometric Optimization

Linear Programming 15 contain such a constraint), which implies that after kd iterations (H) (B) 2k. Hence, after kd successful rounds, 2k (H) nek=3. This implies that the above algorithm terminates in at most 3d lnn successful rounds. Since each round takes O(dd) time to compute xR and O(dn) time to compute V , the expected running time of the algorithm is O((d2n+dd+1) log n). By combining thi...

متن کامل

Global optimization of fractional posynomial geometric programming problems under fuzziness

In this paper we consider a global optimization approach for solving fuzzy fractional posynomial geometric programming problems. The problem of concern involves positive trapezoidal fuzzy numbers in the objective function. For obtaining an optimal solution, Dinkelbach’s algorithm which achieves the optimal solution of the optimization problem by means of solving a sequence of subproblems ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications in Mathematical Sciences

سال: 2013

ISSN: 1539-6746,1945-0796

DOI: 10.4310/cms.2013.v11.n1.a6